Explaining Relation Classification Models with Semantic Extents
نویسندگان
چکیده
In recent years, the development of large pretrained language models, such as BERT and GPT, significantly improved information extraction systems on various tasks, including relation classification. State-of-the-art are highly accurate scientific benchmarks. A lack explainability is currently a complicating factor in many real-world applications. Comprehensible necessary to prevent biased, counterintuitive, or harmful decisions. We introduce semantic extents, concept analyze decision patterns for classification task. Semantic extents most influential parts texts concerning Our definition allows similar procedures determine humans models. provide an annotation tool software framework models conveniently reproducibly. Comparing both reveals that tend learn shortcut from data. These hard detect with current interpretability methods, input reductions. approach can help eliminate spurious during model development. increase reliability security natural processing systems. essential step enabling applications critical areas like healthcare finance. Moreover, our work opens new research directions developing methods explain deep learning
منابع مشابه
Composite Semantic Relation Classification
Different semantic interpretation tasks such as text entailment and question answering require the classification of semantic relations between terms or entities within text. However, in most cases it is not possible to assign a direct semantic relation between entities/terms. This paper proposes an approach for composite semantic relation classification, extending the traditional semantic rela...
متن کاملSemantic Relation Classification: Task Formalisation and Refinement
The identification of semantic relations between terms within texts is a fundamental task in Natural Language Processing which can support applications requiring a lightweight semantic interpretation model. Currently, semantic relation classification concentrates on relations which are evaluated over open-domain data. This work provides a critique on the set of abstract relations used for seman...
متن کاملSemantic Relation Classification via Hierarchical Recurrent Neural Network with Attention
Semantic relation classification remains a challenge in natural language processing. In this paper, we introduce a hierarchical recurrent neural network that is capable of extracting information from raw sentences for relation classification. Our model has several distinctive features: (1) Each sentence is divided into three context subsequences according to two annotated nominals, which allows...
متن کاملTUD: Semantic Relatedness for Relation Classification
In this paper, we describe the system submitted by the team TUD to Task 8 at SemEval 2010. The challenge focused on the identification of semantic relations between pairs of nominals in sentences collected from the web. We applied maximum entropy classification using both lexical and syntactic features to describe the nominals and their context. In addition, we experimented with features descri...
متن کاملBuilding and Refining Rhetorical-Semantic Relation Models
We report results of experiments which build and refine models of rhetoricalsemantic relations such as Cause and Contrast. We adopt the approach of Marcu and Echihabi (2002), using a small set of patterns to build relation models, and extend their work by refining the training and classification process using parameter optimization, topic segmentation and syntactic parsing. Using human-annotate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in computer and information science
سال: 2023
ISSN: ['1865-0937', '1865-0929']
DOI: https://doi.org/10.1007/978-3-031-39059-3_13